1004A - Sonya and Hotels - CodeForces Solution

implementation *900

Please click on ads to support us..

Python Code: 

(n, d) = map(int, input().split(' '))
x = list(map(int, input().split(' ')))

hotels = []
x.append(0)

for i in range(n):
    if i == 0:
        if x[i] + d <= x[i + 1] - d:
            hotels.append(x[i] + d)
    else:
        if x[i - 1] + d <= x[i] - d:
            hotels.append(x[i] - d)
        if x[i] + d <= x[i + 1] - d:
            hotels.append(x[i] + d)


hotels.append(x[0] - d)
hotels.append(x[-2] + d)

print(len(set(hotels)))

C++ Code: 

/*                       Hello Ji                                      */
#include<bits/stdc++.h>
#define ll long long 
const int MOD = 1e9 + 7;
#define pb push_back
#define endl "\n"
#define quick ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
using namespace std;
// bool comp(pair<ll,ll> &p1,pair<ll,ll> &p2)
// {
//    return p1.second<p2.second;
// }
void solve()
{
ll n,d;
cin>>n>>d;
ll a[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
ll count = 0;
for(int i=0;i<n-1;i++){
    if(a[i+1]-a[i]==2*d){
        count++;
    }
    else if(a[i+1]-a[i]>2*d){
        count = count + 2;
    }
}
cout << count + 2 << endl;
}
int32_t main()
{
  quick;
  int t = 1;
  // cin>>t;
  while(t--)
  {
    solve();
  }
  cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs" << endl;
  return 0;
}
/*
*/


Comments

Submit
0 Comments
More Questions

1302. Deepest Leaves Sum
1209. Remove All Adjacent Duplicates in String II
994. Rotting Oranges
983. Minimum Cost For Tickets
973. K Closest Points to Origin
969. Pancake Sorting
967. Numbers With Same Consecutive Differences
957. Prison Cells After N Days
946. Validate Stack Sequences
921. Minimum Add to Make Parentheses Valid
881. Boats to Save People
497. Random Point in Non-overlapping Rectangles
528. Random Pick with Weight
470. Implement Rand10() Using Rand7()
866. Prime Palindrome
1516A - Tit for Tat
622. Design Circular Queue
814. Binary Tree Pruning
791. Custom Sort String
787. Cheapest Flights Within K Stops
779. K-th Symbol in Grammar
701. Insert into a Binary Search Tree
429. N-ary Tree Level Order Traversal
739. Daily Temperatures
647. Palindromic Substrings
583. Delete Operation for Two Strings
518. Coin Change 2
516. Longest Palindromic Subsequence
468. Validate IP Address
450. Delete Node in a BST